matlab mex compiler Search Results


96
MathWorks Inc 3 d pair
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
3 D Pair, supplied by MathWorks Inc, used in various techniques. Bioz Stars score: 96/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/3 d pair/product/MathWorks Inc
Average 96 stars, based on 1 article reviews
3 d pair - by Bioz Stars, 2026-06
96/100 stars
  Buy from Supplier

90
MobileRobots Inc mex-compiled aria package
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Mex Compiled Aria Package, supplied by MobileRobots Inc, used in various techniques. Bioz Stars score: 90/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/mex-compiled aria package/product/MobileRobots Inc
Average 90 stars, based on 1 article reviews
mex-compiled aria package - by Bioz Stars, 2026-06
90/100 stars
  Buy from Supplier

95
MathWorks Inc c codes
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
C Codes, supplied by MathWorks Inc, used in various techniques. Bioz Stars score: 95/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/c codes/product/MathWorks Inc
Average 95 stars, based on 1 article reviews
c codes - by Bioz Stars, 2026-06
95/100 stars
  Buy from Supplier

90
Lawrence Livermore National Security LLC odemex cvode wrapper matlab
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Odemex Cvode Wrapper Matlab, supplied by Lawrence Livermore National Security LLC, used in various techniques. Bioz Stars score: 90/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/odemex cvode wrapper matlab/product/Lawrence Livermore National Security LLC
Average 90 stars, based on 1 article reviews
odemex cvode wrapper matlab - by Bioz Stars, 2026-06
90/100 stars
  Buy from Supplier

96
MathWorks Inc realtime workshop
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Realtime Workshop, supplied by MathWorks Inc, used in various techniques. Bioz Stars score: 96/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/realtime workshop/product/MathWorks Inc
Average 96 stars, based on 1 article reviews
realtime workshop - by Bioz Stars, 2026-06
96/100 stars
  Buy from Supplier

90
Lawrence Livermore National Security LLC sundials cvode package
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Sundials Cvode Package, supplied by Lawrence Livermore National Security LLC, used in various techniques. Bioz Stars score: 90/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/sundials cvode package/product/Lawrence Livermore National Security LLC
Average 90 stars, based on 1 article reviews
sundials cvode package - by Bioz Stars, 2026-06
90/100 stars
  Buy from Supplier

92
MathWorks Inc aerospace blockset
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Aerospace Blockset, supplied by MathWorks Inc, used in various techniques. Bioz Stars score: 92/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/aerospace blockset/product/MathWorks Inc
Average 92 stars, based on 1 article reviews
aerospace blockset - by Bioz Stars, 2026-06
92/100 stars
  Buy from Supplier

92
MathWorks Inc matlab simulink version r2021a
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Matlab Simulink Version R2021a, supplied by MathWorks Inc, used in various techniques. Bioz Stars score: 92/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/matlab simulink version r2021a/product/MathWorks Inc
Average 92 stars, based on 1 article reviews
matlab simulink version r2021a - by Bioz Stars, 2026-06
92/100 stars
  Buy from Supplier

96
MathWorks Inc computer vision matlab toolbox
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Computer Vision Matlab Toolbox, supplied by MathWorks Inc, used in various techniques. Bioz Stars score: 96/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/computer vision matlab toolbox/product/MathWorks Inc
Average 96 stars, based on 1 article reviews
computer vision matlab toolbox - by Bioz Stars, 2026-06
96/100 stars
  Buy from Supplier

Image Search Results


Example of sparse image representation using SLIC: (a) coronal view of 3-D CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.

Journal: Journal of Medical Imaging

Article Title: GIFTed Demons: deformable image registration with local structure-preserving regularization using supervoxels for liver applications

doi: 10.1117/1.JMI.5.2.024001

Figure Lengend Snippet: Example of sparse image representation using SLIC: (a) coronal view of 3-D CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.

Article Snippet: The computation time per registration using the presented framework is ≈ 3 min per 3-D pair (on a standard CPU, running nonoptimized C++ code, MATLAB™ mex compiler) and is several times faster than our previous bilateral filtering procedure ( ≈ 60 min ) or the locally adaptive anisotropic regularization (several hours).

Techniques: Generated

Main anatomical views of 3-D CT registration results for case #P0 of the liver dataset: (a) coronal, (b) axial, and (c) sagittal views for the color-coded (red-cyan) intensity differences between volume pair before registration (left), after registration using Demons with isotropic Gaussian kernel, iso-dem, (middle), and guided image filtering with random SLIC clustering, rdn-gif, (right). Registration using our method (right) improves registration accuracy especially close to the lung and liver surfaces (depicted by corresponding red dotted and green solid arrows, respectively).

Journal: Journal of Medical Imaging

Article Title: GIFTed Demons: deformable image registration with local structure-preserving regularization using supervoxels for liver applications

doi: 10.1117/1.JMI.5.2.024001

Figure Lengend Snippet: Main anatomical views of 3-D CT registration results for case #P0 of the liver dataset: (a) coronal, (b) axial, and (c) sagittal views for the color-coded (red-cyan) intensity differences between volume pair before registration (left), after registration using Demons with isotropic Gaussian kernel, iso-dem, (middle), and guided image filtering with random SLIC clustering, rdn-gif, (right). Registration using our method (right) improves registration accuracy especially close to the lung and liver surfaces (depicted by corresponding red dotted and green solid arrows, respectively).

Article Snippet: The computation time per registration using the presented framework is ≈ 3 min per 3-D pair (on a standard CPU, running nonoptimized C++ code, MATLAB™ mex compiler) and is several times faster than our previous bilateral filtering procedure ( ≈ 60 min ) or the locally adaptive anisotropic regularization (several hours).

Techniques:

Main anatomical views of resulting 3-D displacement fields for case #P0 of the liver CT dataset: (a) coronal, (b) axial, and (c) sagittal views for the color-coded magnitude of the displacement field estimated using Demons with isotropic Gaussian kernel, iso-dem, (middle) and guided image filtering with random SLIC clustering, rdn-gif, (right). (left) The reference image with the corresponding blue contour is shown for a guidance to the displacement field. Registration using our method (right) produces a visually smooth displacement field inside the lungs and liver, and at the same, estimates sliding motion at the lung and liver interface [depicted by corresponding red dotted (for lungs) and green solid (for liver) arrows].

Journal: Journal of Medical Imaging

Article Title: GIFTed Demons: deformable image registration with local structure-preserving regularization using supervoxels for liver applications

doi: 10.1117/1.JMI.5.2.024001

Figure Lengend Snippet: Main anatomical views of resulting 3-D displacement fields for case #P0 of the liver CT dataset: (a) coronal, (b) axial, and (c) sagittal views for the color-coded magnitude of the displacement field estimated using Demons with isotropic Gaussian kernel, iso-dem, (middle) and guided image filtering with random SLIC clustering, rdn-gif, (right). (left) The reference image with the corresponding blue contour is shown for a guidance to the displacement field. Registration using our method (right) produces a visually smooth displacement field inside the lungs and liver, and at the same, estimates sliding motion at the lung and liver interface [depicted by corresponding red dotted (for lungs) and green solid (for liver) arrows].

Article Snippet: The computation time per registration using the presented framework is ≈ 3 min per 3-D pair (on a standard CPU, running nonoptimized C++ code, MATLAB™ mex compiler) and is several times faster than our previous bilateral filtering procedure ( ≈ 60 min ) or the locally adaptive anisotropic regularization (several hours).

Techniques: